Generating Reflections For U(2, p2n). II, p = 2

Continuous Truth II: Reflections

In the late 1960s, Dana Scott first showed how the Stone Tarski topological interpretation of Heyting’s calculus could be extended to model intuitionistic analysis; in particular Brouwer’s continuity principle. In the early ’80s we and others outlined a general treatment of non-constructive objects, using sheaf models—constructions from topos theory—to model not only Brouwer’s non-classical con...

Reflections on Copyediting II

Generating elements of orders dividing p 6 ± p 5 + p 4 ± p 3 + p 2 ± p + 1 Maciej Grześkowiak ∗

In this paper we propose an algorithm for computing large primes p and q such that q divides p + p + p + p + p + p + 1 or p − p + p − p + p − p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.

Generating elements of orders dividing p 6 ± p 5 + p 4 ± p 3 + p 2 ± p + 1 Maciej

In this paper we propose an algorithm for computing large primes p and q such that q divides p + p + p + p + p + p + 1 or p − p + p − p + p − p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.

Generating p-extremal graphs

Let f(n, p) be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved that there exist constants np and cp so that for even n ≥ np, f(n, p) = n 2 4 + cp; we call a graph p-extremal if it has p perfect matchings and n2 4 + cp edges. In this paper, we develop structural theorems in matching theory to study p-extremal graphs and use them in a new co...